Constructions of non-principal families in extremal hypergraph theory
نویسندگان
چکیده
A family F of k-graphs is called non-principal if its Turán density is strictly smaller than that of each individual member. For each k ≥ 3 we find two (explicit) k-graphs F and G such that {F,G} is ∗This author is partially supported by NSF grant DMS-0400812.
منابع مشابه
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transversals. We show that for an arbitrary hypergraph the families of multiple and partial transversals are both dual-bounded in the sense that the size of the corresponding dual hypergraph is bounded by a polynomial in the...
متن کاملWeighted Transversals of a Hypergraph
We consider a generalization of the notion of transversal to a finite hypergraph, so called weighted transversals. Given a non-negative weight vector assigned to each hyperedge of the input hypergraph, we define a weighted transversal as a minimal vertex set which intersects a collection of hyperedges of sufficiently large total weight. We show that the hypergraph of all weighted transversals i...
متن کاملSperner families satisfying additional conditions and their convex hulls
The profile of a hypergraph on n vertices is (f0 ..... fn) where fi denotes the number of /-element edges. The extreme points of the set of the profiles are determined for Sperner hyper-graphs satisfying some additional conditions. The results contain some old theorems of extremal set theory as particular cases.
متن کاملTriple Systems Not Containing a Fano Configuration
Given a 3-uniform hypergraph F , let ex3(n,F) denote the maximum possible size of a 3-uniform hypergraph of order n that does not contain any subhypergraph isomorphic to F . Our terminology follows that of [16] and [10], which are comprehensive survey articles of Turán-type extremal graph and hypergraph problems, respectively. Also see the monograph of Bollobás [2]. There is an extensive litera...
متن کاملOn the Chromatic Thresholds of Hypergraphs
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-negative reals c such that the subfamily of F comprising hypergraphs H with minimum degree at least c (|V (H)| r−1 ) has bounded chromatic number. This parameter has a long history for graphs (r = 2), and in this paper we begin its systematic study for hypergraphs. Luczak and Thomassé recently pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008